The SGPlan Planning System in IPC-6
نویسندگان
چکیده
In this paper, we describe the the planning system SGPlan6 participating in the satisficing tracks of the deterministic part of the Sixth Planning Competition (IPC6). SGPlan6 is designed to solve both temporal and non-temporal planning problems specified in PDDL3 which may have soft goals, derived predicates or ADL features. SGPlan6 inherited the parallel decomposition framework from SGPlan5 which consists of the partitioning procedure, the resolution algorithm, and the subproblem solver. New enhancements are added in SGPlan6 to address poor localities and to further exploit multi-valued domain structure. We identify domain-specific features that lead to the use of techniques for overcoming different scenarios of problem decomposition.
منابع مشابه
New Features in SGPlan for Handling Preferences and Constraints in PDDL3.0∗
In this paper, we describe our enhancements incorporated in SGPlan (hereafter called SGPLan5) for supporting the new features of the PDDL3.0 language used in the Fifth International Planning Competition (IPC5). Based on the architecture of SGPlan that competed in the Fourth IPC (hereafter called SGPLan4), SGPLan5 partitions a large planning problem into subproblems, each with its own subgoal, a...
متن کاملIntroducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: SATPLAN has been the winning system in the deterministic track for optimal planners in the 4th International Planning Competition (IPC) and a co-winner in the 5th IPC. Given a planning problem Π and a makespan n, the approach based on satisfiability (a.k.a., SAT-based) simply works by (i) c...
متن کاملPlanning as Satisfiability with Preferences
Planning as Satisfiability is one of the most well-known and effective technique for classical planning: SATPLAN has been the winning system in the deterministic track for optimal planners in the 4th International Planning Competition (IPC) and a co-winner in the 5th IPC. In this paper we extend the Planning as Satisfiability approach in order to handle preferences and SATPLAN in order to solve...
متن کاملPlanning with Derived Predicates Through Rule-Action Graphs and Local Search Techniques
In classical domain-independent planning, derived predicates are predicates that the domain actions can only indirectly affect. Their truth in a state can be inferred by particular axioms, that enrich the typical operator description of a planning domain. As discussed in [3,6], derived predicates are practically useful to express in a concise and natural way some indirect action effects, such a...
متن کاملSubgoal Partitioning and Resolution in SGPlan∗
In this demo, we illustrate the idea and operations of SGPlan (Chen, Hsu, & Wah 2004; Wah & Chen 2005), a PDDL2.2 planner that won the first prize in the suboptimal temporal metric track and a second prize in the suboptimal propositional track in the Fourth International Planning Competition (IPC4), 2004. SGPlan is the only planner that won in two tracks of the competition. Since SGPlan is a su...
متن کامل